Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. In this paper, Dantzig-Wolfe decomposition is applied to a linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are so...

متن کامل

Dantzig-wolfe Decomposition with Gams

This document illustrates the Dantzig-Wolfe decomposition algorithm using GAMS.

متن کامل

Mechanism Design via Dantzig-Wolfe Decomposition

In random allocation rules, typically first an optimal fractional point is calculated via solving a linear program. Lying in the feasible region of the linear program, the fractional point satisfies the underlying constraints. In effect, the point represents a fractional assignment of objects or more generally packages of objects to agents. In order to implement an expected assignment, one must...

متن کامل

A stabilized structured Dantzig-Wolfe decomposition method

We present an algorithmic scheme, which we call the Structured Dantzig-Wolfe decomposition method, that can be used for solving large-scale structured Linear Programs (LPs). The required structure of the LPs is the same as in the original DantzigWolfe approach, that is, a polyhedron over which optimization is “easy” plus a set of “complicating” constraints. Under the hypothesis that an alternat...

متن کامل

A Computational Study of Dantzig-Wolfe Decomposition

A Computational Study of Dantzig-Wolfe Decomposition James Richard Tebboth This thesis evaluates the computational merits of the Dantzig-Wolfe decomposition algorithm. We use modern computer hardware and software, and, in particular, we have developed an efficient parallel implementation of Dantzig-Wolfe decomposition. We were able to solve problems of up to 83,500 rows, 83,700 columns, and 622...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Aerospace Computing, Information, and Communication

سال: 2010

ISSN: 1542-9423

DOI: 10.2514/1.45606